Parameterized approximation algorithms for packing problems
نویسندگان
چکیده
منابع مشابه
Parameterized approximation algorithms for packing problems
In the past decade, many parameterized algorithms were developed for packing problems. Our goal is to obtain tradeoffs that improve the running times of these algorithms at the cost of computing approximate solutions. Consider a packing problem for which there is no known algorithm with approximation ratio α, and a parameter k. If the value of an optimal solution is at least k, we seek a soluti...
متن کاملDeterministic Parameterized Algorithms for Matching and Packing Problems
We present three deterministic parameterized algorithms for well-studied packing and matching problems, namely, Weighted q-Dimensional p-Matching ((q, p)-WDM) and Weighted qSet p-Packing ((q, p)-WSP). More specifically, we present an O(2.85043) time deterministic algorithm for (q, p)-WDM, an O(8.04143) time deterministic algorithm for the unweighted version of (3, p)-WDM, and an O((0.56201 · 2....
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کاملParameterized Approximation Algorithms for Directed Steiner Network Problems
Given an edge-weighted directed graph G = (V,E) and a set of k terminal pairs {(si, ti)}i=1, the objective of the Directed Steiner Network (DSN) problem is to compute the cheapest subgraph N of G such that there is an si → ti path in N for each i ∈ [k]. This problem is notoriously hard: there is no polytime O(2 1−ε )-approximation [Dodis & Khanna, STOC ’99], and it is W[1]-hard [Guo et al., SID...
متن کاملParameterized Approximation Algorithms for Some Location Problems in Graphs
We develop efficient parameterized, with additive error, approximation algorithms for the (Connected) r-Domination problem and the (Connected) p-Center problem for unweighted and undirected graphs. Given a graph G, we show how to construct a (connected) ( r +O(μ) ) dominating set D with |D| ≤ |D∗| efficiently. Here, D∗ is a minimum (connected) r-dominating set of G and μ is our graph parameter,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.08.004